Data Memory Alternatives for Multiscalar Processors

نویسندگان

  • Scott E. Breach
  • T. N. Vijaykumar
  • Sridhar Gopal
  • James E. Smith
  • Gurindar S. Sohi
چکیده

This work considers data memory alternatives for multiscalar processors that can support the aggressive control and data speculative execution of loads and stores. We discuss the key issues that must be dealt with for such a data memory design and partition the design space of alternatives on the basis of composition, i.e. whether the storage for speculative and architectural versions is separate or aggregate, and on the basis of organization, i.e. whether the storage for speculative and architectural versions is shared or private. Moreover, we attempt to address a broad spectrum of solutions by considering two schemes in terms of centralized and distributed designs: a known scheme, the address resolution buffer which provides distinct speculative and architectural storage; and a novel scheme, the time-sequence cache which merges the speculative and architectural storage. We have performed a preliminary experimental evaluation of designs from opposite ends of the spectrum of solutions. Our experimental evidence from a simulation of a multiscalar processor with a centralized address resolution buffer and a distributed time-sequence cache shows (i) that hit latency is an important performance factor (even for a latency tolerant processor like a multiscalar processor) and (ii) that distributed schemes may trade-off hit rate for hit latency to improve performance over centralized schemes.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multi-Version Caches for Multiscalar Processors

The multiscalar processor, proposed recently for exploiting instruction-level parallelism, is a collection of execution units that are connected together using a ring-type network. This paper investigates the issue of decentralizing the memory system in the multiscalar processor, and proposes a decentralized scheme called multi-version caches. The central idea of this scheme is to have multiple...

متن کامل

The Multiscalar Architecture

The centerpiece of this thesis is a new processing paradigm for exploiting instruction level parallelism. This paradigm, called the multiscalar paradigm, splits the program into many smaller tasks, and exploits fine-grain parallelism by executing multiple, possibly (control and/or data) dependent tasks in parallel using multiple processing elements. Splitting the instruction stream at staticall...

متن کامل

Exploiting Parallelism:The Tera Computer System and the Multiscalar Processors

-Parallelism introduces complexities both in hardware and in software. Studying the Tera Computer System and the multiscalar processor gives us a glimpse of these.

متن کامل

A Message-Passing Distributed Memory Parallel Algorithm for a Dual-Code Thin Layer, Parabolized Navier-Stokes Solver

In this study, the results of parallelization of a 3-D dual code (Thin Layer, Parabolized Navier-Stokes solver) for solving supersonic turbulent flow around body and wing-body combinations are presented. As a serial code, TLNS solver is very time consuming and takes a large part of memory due to the iterative and lengthy computations. Also for complicated geometries, an exceeding number of grid...

متن کامل

Load Balancing in a Distributed-Memory Or-Parallel System

We consider or-parallel logic programming implementations on parallel machines with no shared-memory. Traditional implementation techniques as employed in Aurora and Muse are not applicable. In our orparallel execution model, all processors perform identical work initially. At each choice point, processors are divided evenly among alternatives of the choice point. Backtracking is employed if th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997